Efficient Multiplication of Dense Matrices over GF(2)
نویسندگان
چکیده
We describe an efficient implementation of a hierarchy of algorithms for multiplication of dense matrices over the field with two elements (F2). In particular we present our implementation – in the M4RI library – of Strassen-Winograd matrix multiplication and the “Method of the Four Russians” multiplication (M4RM) and compare it against other available implementations. Superior performance is demonstrated on Intel’s Core 2 Duo and good performance on AMD’s Opteron. The open-source M4RI library is available stand-alone and as part of the Sage mathematics software.
منابع مشابه
SMITH - A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we call SMITH1, can solve any regular and (uniquely solvable) overdetermined linear system of equations (LSE) and is not limited to matrices of a certain structure. Besides solving LSEs, the architecture at hand can also ...
متن کاملEfficient Decomposition of Dense Matrices over GF(2)
In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (F2). Matrix decomposition is an essential building block for solving dense systems of linear and non-linear equations and thus much research has been devoted to improve the asymptotic complexity of such algorithms. In this work we discuss an...
متن کاملDesign of Polynomial Basis Multipliers over Gf(2)
This article addresses an efficient hardware implementations for multiplication over finite field GF(2). Multiplication in GF(2) is very commonly used in cryptography and error correcting codes. An efficient hardware could reduce the cost and development for these applications. This work presents the hardware implementation of polynomial basis. In this case, the multipliers were designed using ...
متن کاملDecoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes
This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 [13]) that Karatsuba’s algorithm outperforms classical...
متن کاملDecoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Scheme
This paper compares the efficiency of various algorithms for implementing public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 [13]) that Karatsuba’s algorithm outperforms classical polynomial multip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0811.1714 شماره
صفحات -
تاریخ انتشار 2008